Dynamic Spectral Clustering
نویسندگان
چکیده
Clustering is a powerful tool for data classification; however, its application has been limited to analysis of static snapshots of data which may be time-evolving. This work presents a clustering algorithm that employs a fixed time interval and a time-aggregated similarity measure to determine classification. The fixed time interval and a weighting parameter are tuned to the system’s dynamics; otherwise the algorithm proceeds automatically finding the optimal cluster number and appropriate clusters at each time point in the dataset. The viability and contribution of the method is shown through simulation.
منابع مشابه
Spatial Data Mining with the Application of Spectral Clustering: A Trend Detection Approach
Spectral clustering in spatial data mining plays a very important and innovative role due to its capacity of handling of large size of data ,effective application of linear algebra to solve graphical representation and problems, and application of very low cost of clustering algorithms like k-nearest or є neighbourhood graph. Most of the research in this area is focused on efficient query proce...
متن کاملSpectral Co-Clustering for Dynamic Bipartite Graphs
A common task in many domains with a temporal aspect involves identifying and tracking clusters over time. Often dynamic data will have a feature-based representation. In some cases, a direct mapping will exist for both objects and features over time. But in many scenarios, smaller subsets of objects or features alone will persist across successive time periods. To address this issue, we propos...
متن کاملSegmentation of dynamic PET images with kinetic spectral clustering.
Segmentation is often required for the analysis of dynamic positron emission tomography (PET) images. However, noise and low spatial resolution make it a difficult task and several supervised and unsupervised methods have been proposed in the literature to perform the segmentation based on semi-automatic clustering of the time activity curves of voxels. In this paper we propose a new method bas...
متن کاملA multi-similarity spectral clustering method for community detection in dynamic networks
Community structure is one of the fundamental characteristics of complex networks. Many methods have been proposed for community detection. However, most of these methods are designed for static networks and are not suitable for dynamic networks that evolve over time. Recently, the evolutionary clustering framework was proposed for clustering dynamic data, and it can also be used for community ...
متن کاملClustering on Dynamic Social Network Data
This paper presents a reference data set along with a labeling for graph clustering algorithms, especially for those handling dynamic graph data. We implemented a modification of Iterative Conductance Cutting and a spectral clustering. As base data set we used a filtered part of the Enron corpus. Different cluster measurements, as intra-cluster density, inter-cluster sparseness, and Q-Modularit...
متن کاملComparison of Clustering Approaches for Gene Expression Data
Clustering algorithms have been used to divide genes into groups according to the degree of their expression similarity. Such a grouping may suggest that the respective genes are correlated and/or co-regulated, and subsequently indicates that the genes could possibly share a common biological role. In this paper, four clustering algorithms are investigated: k-means, cut-clustering, spectral and...
متن کامل